Further ideal multipartite access structures from integer polymatroids
نویسندگان
چکیده
منابع مشابه
Ideal Secret Sharing Schemes for Useful Multipartite Access Structures
This paper is a survey of the main results and open problems in a line of work that was initiated shortly after secret sharing was introduced. Namely, the construction of ideal linear secret sharing schemes for access structures that are natural generalizations of the threshold ones and have interesting properties for the applications. Some of them have hierarchical properties, while other ones...
متن کاملIdeal secret sharing schemes with multipartite access structures
The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have been classified, the case for multipartite...
متن کاملIdeal Homogeneous Access Structures Constructed from Graphs
Starting from a new relation between graphs and secret sharing schemes introduced by Xiao, Liu and Zhang, we show a method to construct more general ideal homogeneous access structures. The method has some advantages: it efficiently gives an ideal homogeneous access structure for the desired rank, and some conditions can be imposed (such as forbidden or necessary subsets of players), even if th...
متن کاملSecret sharing schemes for Multipartite access structures
Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. Secret sharing schemes are introduced to solve the problems for securing sensitive information. In this paper, we review our proposed hierarchical and compartmented ...
متن کاملOn Representable Matroids and Ideal Secret Sharing
In secret sharing, the exact characterization of ideal access structures is a longstanding open problem. Brickell and Davenport (J. of Cryptology, 1991) proved that ideal access structures are induced by matroids. Subsequently, ideal access structures and access structures induced by matroids have attracted a lot of attention. Due to the difficulty of finding general results, the characterizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2015
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-015-5286-x